Graphics Turing Test
نویسنده
چکیده
We define a Graphics Turing Test to measure graphics performance in a similar manner to the definition of the traditional Turing Test. To pass the test one needs to reach a computational scale, the Graphics Turing Scale, for which Computer Generated Imagery becomes comparatively indistinguishable from real images while also being interactive. We derive an estimate for this computational scale which, although large, is within reach of todays supercomputers. We consider advantages and disadvantages of various computer systems designed to pass the Graphics Turing Test. Finally we discuss commercial applications from the creation of such a system, in particular Interactive Cinema. Defining graphics computing scales can be difficult. Traditional methods such as counting triangles drawn per second can be misleading especially if a large percentage of the computing power is going into shading code or a physics simulation which can be involved in making the graphics image realistic. More than fifty years ago Alan Turing faced a similar challenge in evaluating the power of a computer. In short, he devised a test to see if one can build a computer whose intelligence was indistinguishable from human intelligence [1]. The Turing computational scale is then defined by the computational power required to pass this test. The beauty of this definition is that the computational scale is defined by the indistinguishability of comparison. In particular one does not need a definition of human intelligence to implement the test. Also one does not need to measure in terms of Flops per second or some other commonly used method of measuring computer power, after all integer performance, memory access or network connectivity may be important. One only needs to statistically compare how subjects can discriminate between a human and a computer. If the subjects can do no better than a random guess than the Turing test is passed and the Turing scale has been measured. Unfortunately the Turing Test is too hard for now, one cannot even use partial successes in AI to estimate the size of a computer required to pass the test [2]. As we shall see the corresponding situation in graphics is somewhat better.
منابع مشابه
Using a Graphics Turing Test to Evaluate the Effect of Frame Rate and Motion Blur on Telepresence of Animated Objects
A limited Graphics Turing Test is used to determine the frame rate that is required to achieve telepresence of an animated object. For low object velocities of 2.25 and 4.5 degrees of visual angle per second at 60 frames per second a rotating object with no added motion blur is able to pass the test. The results of the experiments confirm previous results in psychophysics and show that the Grap...
متن کاملPractical Implementation of a Graphics Turing Test
We present a practical implementation of a variation of the Turing Test for realistic computer graphics. The test determines whether virtual representations of objects appear as real as genuine objects. Two experiments were conducted wherein a real object and a similar virtual object is presented to test subjects under specific restrictions. A criterion for passing the test is presented based o...
متن کاملMitigating Dictionary Attacks with Text-Graphics Character Captchas
We propose a new construct, the Text-Graphics Character (TGC) CAPTCHA, for preventing dictionary attacks against password authentication systems allowing remote access via dumb terminals. Password authentication is commonly used for computer access control. But password authentication systems are prone to dictionary attacks, in which attackers repeatedly attempt to gain access using the entries...
متن کاملToward the Graphics Turing Scale on a Blue Gene Supercomputer
We investigate raytracing performance that can be achieved on a class of Blue Gene supercomputers. We measure a 822 times speedup over a Pentium IV on a 6144 processor Blue Gene/L. We measure the computational performance as a function of number of processors and problem size to determine the scaling performance of the raytracing calculation on the Blue Gene. We find nontrivial scaling behavior...
متن کاملRay tracing - computing the incomputable?
We recall from previous work a model-independent framework of computational complexity theory. Notably for the present paper, the framework allows formalization of the issues of precision that present themselves when one considers physical, error-prone (especially analogue rather than digital) computational systems. We take as a case study the ray-tracing problem, a Turing-machineincomputable p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0603132 شماره
صفحات -
تاریخ انتشار 2006